Functional Dependencies with Counting on Trees

نویسنده

  • Klaus-Dieter Schewe
چکیده

The paper presents an axiomatisation for functional dependencies on trees that are defined using constructors for records, lists, sets and multisets. A simple form of restructuring permitting lists to be mapped onto multisets and multisets onto sets is added to the theory. Furthermore, the theory handles dependencies on sets treated as multisets. This adds the possibility to use the count of elements in the dependencies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting

The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.

متن کامل

Counting the number of spanning trees of graphs

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

متن کامل

Sensitivity of Counting Queries

In the context of statistical databases, the release of accurate statistical information about the collected data often puts at risk the privacy of the individual contributors. The goal of differential privacy is to maximise the utility of a query while protecting the individual records in the database. A natural way to achieve differential privacy is to add statistical noise to the result of t...

متن کامل

Statistical French Dependency Parsing: Treebank Conversion and First Results

We first describe the automatic conversion of the French Treebank (Abeillé and Barrier, 2004), a constituency treebank, into typed projective dependency trees. In order to evaluate the overall quality of the resulting dependency treebank, and to quantify the cases where the projectivity constraint leads to wrong dependencies, we compare a subset of the converted treebank to manually validated d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2005